Constraint Technology Applied to Forest Treatment Scheduling

نویسندگان

  • Junas Adhikary
  • Geir Hasle
  • Gunnar Misund
چکیده

Forest treatment planning and scheduling is an important part of forest resource management. It is a complex task requiring expertise and integration of multi-disciplinary fields. In this paper, we outline a real life problem from the ECOPLAN project called the Long Term Forest Treatment Scheduling Problem (LTFTSP). A review of optimization techniques applicable to forest treatment problems in general is presented, and contrasted with our case. The review suggests that long term scheduling is difficult because of the prohibitive size and complexity inherent to the problem. Based on experience from the successful resolution of a simplified problem, we advocate the use of iterative improvement techniques as a solution strategy. Iterative improvement techniques will in general benefit from high quality initial solutions. We show how a Constraint Satisfaction Problem formulation of the LTFTSP can be used to generate initial solutions. A key element to success is the use of a forest simulator for knowledge based definition of variable domains. The initial solution generator will be used as a module in an integrated forest treatment scheduling system which is under development in the ECOPLAN project. ∗Intelligent Systems Lab, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6, [email protected], http://www.cs.sfu.ca/cs/research/groups/ISL/ †SINTEF Applied Mathematics, Departmernt of Optimisation, Oslo, Norway, [email protected], http://www.oslo.sintef.no/am/ ‡SINTEF Applied Mathematics, Department of Spatial Modelling, Oslo, Norway, [email protected], http://www.oslo.sintef.no/am/

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integration of Constraint Reasoning, and Simulation models in Forest Harvest Scheduling

Forest harvest planning and scheduling problem is an important part of forest resource management. It is a complex task requiring expertise and integration of multidisciplinary elds. We review mathematical programming as applied to forest harvesting problem. The review suggests that long term scheduling is diicult because of the prohibitive size of the model. Such long term scheduling allows on...

متن کامل

A multi-objective mathematical model for nurse scheduling problem with hybrid DEA and augmented ε-constraint method: A case study

The efficient management of nursing personnel is of vital importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. In the nurse scheduling problem (NSP), the target is to allocate shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. This paper presents a multi-objective...

متن کامل

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

متن کامل

A mathematical model for sustainable probabilistic network design problem with construction scheduling considering social and environmental issues

Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...

متن کامل

An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997